Comparative Study of Cuckoo Inspired Metaheuristics Applying to Knapsack Problems
نویسندگان
چکیده
منابع مشابه
Comparative Study of Cuckoo Inspired Metaheuristics Applying to Knapsack Problems
Cuckoo Optimization Algorithm (COA) and Cuckoo Search Algorithm (CS) are two population-based metaheuristics. They are based on the cuckoo’s behavior in their lifestyle and their characteristics in egg laying and breeding. Both algorithms are proposed for continuous optimization problems. In this paper, we propose a comparative study of COA and CS. For this we have proposed a binary version of ...
متن کاملapplying transitivity theory to gender analysis of efl textbook: : a comparative study.
efl/esl textbooks have been regarded as essential language teaching materials with which the learners spend about 70 up to 90 percent of their class time. the important role they play and their vast use make them not only influential in learning the language but also in shaping values and attitudes. put it another way, textbooks socialize learners using their contents (i.e. texts, illustrations...
15 صفحه اولA novel quantum inspired cuckoo search for knapsack problems
This paper presents a new inspired algorithm called Quantum Inspired Cuckoo Search Algorithm (QICSA). This one is new framework relying on Quantum Computing principles and Cuckoo Search algorithm. The contribution consists in defining an appropriate representation scheme in the cuckoo search algorithm that allows applying successfully on combinatorial optimization problems some quantum computin...
متن کاملComparative Study of Bio-inspired algorithms for Unconstrained Optimization Problems
Nature inspired meta-heuristic algorithms are iterative search processes which find near optimal solutions by efficiently performing exploration and exploitation of the solution space. Considering the solution space in a specified region, this work compares performances of Bat, Cuckoo search and Firefly algorithms for unconstrained optimization problems. Global optima are found using various te...
متن کاملNeural metaheuristics for the multidimensional knapsack problem
The multidimensional knapsack problem (MKP) belongs to a very important class of integer optimization problems. In this study, we propose, develop and test metaheuristics based on the neural-networks paradigm for solving the MKP. We show how domain-specific knowledge can be incorporated within the neural-network framework for solving this NP-Hard problem. We provide a mathematical formulation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016912508